Matching Pursuit Video Coding|part Ii: Operational Models for Rate and Distortion
نویسنده
چکیده
We introduce two models for predicting the rate and distortion of the matching pursuit video codec. The rst model is based on a pre-coding analysis pass using the full matching pursuit dictionary. The second model is based on a reduced-complexity analysis pass. We evaluate these models for use within existing rate-distortion optimization techniques. Our prediction results suggest that the models have suucient accuracy to be useful in this context, and that signiicant complexity reductions could be achieved compared to exact rate-distortion computation.
منابع مشابه
Hybrid video coding using bi-dimensional matching pursuit
In this report we propose a new coding scheme based on the Matching Pursuit algorithm and exploiting some of the new features introduced by H.264 for motion estimation. Main points of this work are the design of a redundant dictionary suitable for coding displaced frame differences, the use of fast techniques for atom selection, which work in the Fourier domain and exploit the spatial localizat...
متن کاملModulus quantization for matching-pursuit video coding
Overcomplete signal decomposition using matching pursuits has been shown to be an eecient technique for coding motion residual images in a hybrid video coder. Unlike orthogonal decomposition, matching pursuit uses an in-the-loop modulus quantizer which must be speciied before coding begins. This complicates the quantizer design, since the optimal quantizer depends on the statistics of the match...
متن کاملFractal video coding by matching pursuit
Fractal image and video coders use redundancies present in different scales of natural images for compression. Motion compensation, on the other hand, is a powerful method for exploiting similarities at the same scale in frames of a video sequence. In this paper, a new method is proposed to take advantage of both interscale and intrascale selfsimilarities present in video sequences. A rate-dist...
متن کاملDependent coding in quantized matching pursuit
Matching pursuit, introduced by Mallat and Zhang, is an algorithm for decomposing a signal into a linear combination of functions chosen from possibly redundant dictionary of functions. (A similar greedy algorithm is well known for nding sparse approximate solutions to underdetermined linear systems of equations.) A variant which we call quantized matching pursuit (QMP) has been proposed for va...
متن کاملFractal image coding using rate-distortion optimized matching pursuit
Matching pursuit is a general and exible method for solving an optimization problem that is of interest in signal analysis, coding, control theory and statistics. In this paper, principles of rate-distortion optimal coding are used in combination with matching pursuit algorithm to obtain an enhanced fractal image coding method. The advantages of using such a method over traditional fractal imag...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002